Partial Recognizing Algorithm for Verification Of

The paper presents the formal definition of workflow process, its semantics and correctness assertion. A partial recognizing algorithm for formal verification of acyclic workflow processes is suggested. The algorithm uses molds that represent upper and lower approximations of environment state sets. The consideration of mold transformations on all branching paths allows to avoid the process execution and examination per each input. At the same time the use of molds makes the verification algorithm as a partially recognizing one: there is a possibility that the assertion about the workflow process correctness is neither confirmed nor rejected. The algorithm is applied to verify the workflow library processes provided by IBM for IT Infrastructure.